A Distributed Garbage Collection Algorithm

نویسندگان

  • Terence Critchlow
  • Terence J. Critchlow
چکیده

Concurrent Scheme extends the Scheme programming language, providing parallel program execution on a distributed network. The Concurrent Scheme environment requires a garbage collector to reclaim global objects; objects that exist in a portion of the global heap located on the node that created them. Because a global object may be referenced by several nodes, traditional garbage collection algorithms cannot be used. The garbage collector used must be able to reclaim global objects with minimal disturbance to the user program, and without the use of global state information. It must operate asynchronously, have a low network overhead, and be able to handle out-of-order messages. This thesis describes a distributed reference counting garbage collector appropriate for the reclamation of global objects in the Concurrent Scheme environment. To Heidi For Heidi Because of Heidi CONTENTS ABSTRACT : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : iv LIST OF FIGURES : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : viii ACKNOWLEDGMENTS : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : ix CHAPTERS

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Non-blocking Snapshot Algorithm for Distributed Garbage Collection of Mobile Active Objects

Distributed actor garbage collection differs from distributed object garbage collection in that it needs to consider in-transit message detection, unordered message reception, and actor migration. In this paper, we propose a new snapshot-based distributed actor garbage collection algorithm. The algorithm does not require First-In-First-Out or blocking communication, nor message logging. Further...

متن کامل

PerDiS PPF Case Study: Fitting a Distributed Garbage Collection Algorithm to a Persistent Distributed Store Architecture

Several garbage collection algorithms exist, but it is not always straightforward to adapt them to a given platform. In this article, we describe our work to t a distributed garbage collection algorithm to a persistent distributed store called PerDiS. We pinpoint ordering and consistency problems, and present the way we solved them. We also address the dilemma of performance versus modularity.

متن کامل

Distributed Garbage Collection Algorithms

This seminar report presents adoptions of uniprocessor garbage collection techniques which are able to operate in a new context: distributed systems. We see that their application to distributed system poses new problems and that there is currently no algorithm available solving, or even addressing, all of them. The presented algorithms are structured according to their belonging family: refere...

متن کامل

Cyclic Distributed Garbage Collection Without Global Synchronization in CORBA

1 Abstract This paper describes an algorithm for cyclic distributed garbage collection and its implementation. The algorithm is an extension of reference-listing that collects cyclic garbage. It uses back-tracing instead of mark-and-sweep to eliminate the need of global synchronization. First, by using a special heuristic the algorithm chooses an object that is likely to be garbage (suspect). T...

متن کامل

Cyclic distributed garbage collection

With the continued growth of distributed systems as a means to provide shared data, designers are turning their attention to garbage collection, prompted by the complexity of memory management and the desire for transparent object management. Garbage collection in very large address spaces is a di cult and unsolved problem, due to problems of e ciency, fault-tolerance, scalability and completen...

متن کامل

A Cyclic Distributed Garbage Collector for Network Objects

This paper presents an algorithm for distributed garbage collection and outlines its implementation within the Network Objects system The algorithm is based on a reference listing scheme which is augmented by partial tracing in order to collect distributed garbage cy cles Processes may be dynamically organised into groups according to appropriate heuristics to reclaim distributed garbage cycles...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992